A Duality Algorithm for the Obstacle Problem∗
نویسندگان
چکیده
We consider the obstacle problem in Sobolev spaces, of order strictly greater then the dimension of the domain. The aim is to propose an algorithm to find the solution of the obstacle problem, based on the solution of the dual approximating problem, which is, in fact, a finite dimensional quadratic minimization problem. MSC: 65K10, 65K15, 90C59, 49N15. keywords: obstacle problem, dual problem
منابع مشابه
An Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...
متن کاملAn Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...
متن کاملA duality-type method for the obstacle problem
Based on a duality property, we solve the obstacle problem on Sobolev spaces of higher order. We have considered a new type of approximate problem and with the help of the duality we reduce it to a quadratic optimization problem, which can be solved much easier.
متن کاملAutomatic tuning of a behavior-based guidance algorithm for formation flight of quadrotors
This paper presents a tuned behavior-based guidance algorithm for formation flight of quadrotors. The behavior-based approach provides the basis for the simultaneous realization of different behaviors such as leader following and obstacle avoidance for a group of agents; in our case they are quadcopters. In this paper optimization techniques are utilized to tune the parameters of a behavior-bas...
متن کاملA New Infeasible Interior-Point Algorithm with Full Nesterov-Todd Step for Semi-Definite Optimization
We present a new full Nesterov and Todd step infeasible interior-point algorithm for semi-definite optimization. The algorithm decreases the duality gap and the feasibility residuals at the same rate. In the algorithm, we construct strictly feasible iterates for a sequence of perturbations of the given problem and its dual problem. Every main iteration of the algorithm consists of a feasibili...
متن کامل